A Semantics for Probabilistic Quantifier-Free First-Order Languages, with Particular Application to Story Understanding

نویسندگان

  • Eugene Charniak
  • Robert P. Goldman
چکیده

We present a semantics for interpreting probabilistic statements expressed in a first-order quantifier-free language. We show how this semantics places constraints on the probabilities which can be associated with such statements. We then consider its use in the area of story understanding. We show that for at least simple models of stories (equivalent to the script/plan models) there arc ways to specify reasonably good probabilities. Lastly, we show that while the semantics dictates seemingly implausibly low prior probabilities for equality statements, once they are conditioned by an assumption of spatio-temporal locality of observation the probabilities become "reasonable."

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Descriptive Complexity Approach to LOGCFL

Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC and its subclasses. In the absence of the BIT predicate, we reso...

متن کامل

Baire Category Quantifier in Monadic Second Order Logic

We consider Rabin’s Monadic Second Order logic (MSO) of the full binary tree extended with Harvey Friedman’s “for almost all” second-order quantifier (∀∗) with semantics given in terms of Baire Category. In Theorem 1 we prove that the new quantifier can be eliminated (MSO+∀∗ =MSO). We then apply this result to prove in Theorem 2 that the finite–SAT problem for the qualitative fragment of the pr...

متن کامل

Liftability of Probabilistic Inference: Upper and Lower Bounds

We introduce a general framework for defining classes of probabilistic-logic models and associated classes of inference problems. Within this framework we investigate the complexity of inference in terms of the size of logical variable domains, query and evidence, corresponding to different notions of liftability. Surveying existing and introducing new results, we present an initial complexity ...

متن کامل

Probabilistic Temporal

Complex real-world systems consist of collections of interacting pro-cesses/events. These processes change over time in response to both internal and external stimuli as well as to the passage of time itself. Many domains such as real-time systems diagnosis, story understanding, and nancial forecasting require the capability to model complex systems under a uniied framework to deal with both ti...

متن کامل

A The Tale of the Quantifier Alternation Hierarchy of First-Order Logic over Words

In other words, we ask whether the input language belongs to the class of languages defined by the logic, hence the name of the problem: the F-membership problem. Having an F-membership algorithm in hand amounts to having an effective description of all regular properties that F can express. This is why obtaining a membership algorithm is viewed as the goal to strive for when trying to get a pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989